Resource remapping and regrouping in a wireless communication system

ABSTRACT

Methods and apparatus for remapping and regrouping transmission resources in a wireless communication system. First, a set of new permutation algorithms based on Galois field operation is proposed. Then the proposed algorithms and the known Pruned Bit Reversal Ordering (PBRO) algorithm are applied to several of various resource mapping schemes, including slot or symbol level Orthogonal Cover (OC)/Cyclic Shift (CS) mapping, cell-specific slot-level and symbol-level CS hopping patterns, and subframe and slot level base sequence hopping patterns.

CLAIM OF PRIORITY

This application is a continuation of U.S. patent application Ser. No.12/200,462, filed on Aug. 28, 2008, entitled “RESOURCE REMAPPING ANDREGROUPING IN A WIRELESS COMMUNICATION SYSTEM,” now U.S. Pat. No.8,077,693, which claims priority to U.S. Provisional Patent ApplicationNo. 60/960,191 filed on Sep. 19, 2007, and U.S. Provisional PatentApplication No. 60/960,497 filed on Oct. 1, 2007. U.S. patentapplication Ser. No. 12/200,462 is assigned to the assignee of thepresent application and is incorporated by reference into thisdisclosure as if fully set forth herein. This disclosure hereby claimspriority under 35 U.S.C. §120 to U.S. patent application Ser. No.12/200,462. This application makes reference to, incorporates the sameherein, and claims all benefits accruing under 35 U.S.C. § 119 fromprovisional applications earlier filed in the U.S. Patent & TrademarkOffice on 19 Sep. 2007 and there duly assigned Ser. No. 60/960,191, andon 1 Oct. 2007 and there duly assigned Ser. No. 60/960,497,respectively.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to methods and apparatus for remapping andregrouping transmission resources in a wireless communication system.

2. Description of the Related Art

The present invention incorporates by reference the followingreferences:

[1] 3GPP RAN1#50 Chairman's Notes, August 2007, Athens, Greece

[2] R1-073541, “UL ACK/NACK Structure, Samsung, RAN1#50, August 2007,Athens, Greece

[3] R1-073564, “Selection of Orthogonal Cover and Cyclic Shift for HighSpeed UL ACK Channels”, Samsung, RAN1#50, August 2007, Athens, Greece

[4] R1-072225, “CCE to RE mapping”, Samsung, RAN1#49, Kobe, May 2007

[5] R1-073412, “Randomization of intra-cell interference in PUCCH”,ETRI, RAN1#50, Athens, August 2007

[6] R1-073413, “Sequence allocation and hopping for uplink ACK/NACKchannels”, ETRI, RAN1#50, Athens, August 2007

[7] R1-073661, “Signaling of implicit ACK/NACK resources”, NokiaSiemens, Nokia, RAN1 #50, Athens, August 2007

Telecommunication enables transmission of data over a distance for thepurpose of communication between a transmitter and a receiver. The datais usually carried by radio waves and is transmitted using a limitedtransmission resource. That is, radio waves are transmitted over aperiod of time using a limited frequency range.

In Third (3^(rd)) Generation Partnership Project Long Term Evolution(3GPP LTE) systems, one type of the transmission resource used in theuplink control channel (PUCCH) is known as a Cyclic shift (CS) for eachOFDM symbol. For example, the PUCCH occupies twelve subcarriers in oneresource block (RB) and therefore twelve CS resources in one RB.

In addition, according to the current working assumption on thetransmission block of UL acknowledgement (ACK) channel and referencesignal (RS), acknowledgement and negative acknowledgement (ACK/NAK)signals and the uplink (UL) RS for ACK/NACK demodulation are multiplexedon the code channels constructed by both a cyclic shift (CS) of a basesequence and an orthogonal cover (OC). One example of base sequence isZadoff-Chu sequence.

One important aspect of system design is resource remapping on a symbol,slot or subframe-level. Although some methods have been proposed in thepast such as the remapping table based approach disclosed in Reference[5], the remapping table based approach requires the storage of theremapping table and is therefore not desirable. We attempt to find anefficient yet general method for resource remapping in this invention.

SUMMARY OF THE INVENTION

It is therefore an object of the present invention to provide improvedmethods and apparatus for wireless communication.

It is another object of the present invention to provide improvedmethods and apparatus for efficiently remapping and regroupingtransmission resources in a wireless communication system.

According to one aspect of the present invention, a global resourcemapping scheme is established between N resource combinations in a firsttime slot and N resource combinations in a second time slot independence upon a certain parameter n. The mapping scheme is establishedby:j=g(i,n),where i denotes the index of a resource combination in the first timeslot and i=1, 2, . . . , N, j denotes the index of a resourcecombination in the second time slot and j=1, 2, . . . , N, and g(a,b) isa pseudo-random function.

The pseudo-random function may be a Galois Field based permutationfunction established by:j=g(i,n)=P _(G)(i,n,N),where n is selected from a set of integers {1, 2, . . . , N}.

Alternatively, the pseudo-random function may be a Pruned Bit ReversalOrdering (PBRO) function established by:j=g(i,n)=PRBO(mod(i+n−1,N)+1,N).

The parameter n may be the same for all cells in the communicationnetwork.

Alternatively, the parameter n may be assigned to each cell in thecommunication network in dependence upon an identification of the cell.

Each of the resource combinations includes an orthogonal cover selectedfrom a plurality of orthogonal covers and a cyclic shift of a basesequence selected from a plurality of cyclic shifts. A cell-specificsymbol level cyclic shift hopping pattern may be established to shiftthe index of the cyclic shift within at least one resource combinationon a modulation symbol in a subframe in a cell by an amount specified byh_sym(c_id,s_id,l_id). The post-shifting index v_(i)′ of the cyclicshift having a pre-shifting index of v_(i) within an i-th resourcecombination is established by:v _(i)′=cyclic_shift(v _(i) ,h_sym(c _(—) id,s _(—) id,l _(—) id),K)where c_id denotes the identification of the cell, s_id denotes theidentification of the subframe, l_id denotes the identification of themodulation symbol, K denotes the total number of the plurality of cyclicshifts, and cyclic_shift(a,b,N)=mod(a+b−1,N)+1 when the plurality ofcyclic shifts are indexed as 1, 2, . . . , N.

The function h_sym(c_id,s_id,l_id) may be one of a Galois Field basedpermutation function established by:h_sym(c _(—) id,s _(—) id,l _(—) id)=P _(G)(x(l _(—) id,K),r(c _(—)id,n,K),K),and a Pruned Bit Reversal Ordering (PBRO) function established by:h_sym(c _(—) id,s _(—) id,l _(—) id)=PBRO(mod(l _(—) id+c _(—)id+n−1,K)+1,K),where x(l_id,K)=mod(l_id−1,K)+1, and r(c_id,n,K)=mod(c_id+n−1,K)+1.

Alternatively, a cell-specific slot-level cyclic shift hopping patternmay be established to shift the index of the cyclic shift within atleast one resource combination in a time slot in a cell by an amountspecified by h_slot(c_id,sl_id). The post-shifting index v_(i)′ of thecyclic shift having a pre-shifting index of v_(i) within an i-thresource combination is established by:v _(i)′=cyclic_shift(v _(i) ,h_slot(c _(—) id, sl _(—) id),K)where c_id denotes the identification of the cell, sl_id denotes theidentification of the time slot, K denotes the total number of theplurality of cyclic shifts, and cyclic_shift(a,b,N)=mod(a+b−1,N)+1 whenthe plurality of cyclic shifts are indexed as 1, 2, . . . , N. Thefunction h_slot(c_id,sl_id) may be one of a Galois Field basedpermutation function established by:h_slot(c _(—) id,sl _(—) id)=P _(G)(sl _(—) id, r(c _(—) id,n,K),K),and a Pruned Bit Reversal Ordering (PBRO) function established by:h_slot(c _(—) id,sl _(—) id)=PBRO(mod(sl _(—) id+c _(—) id+n−1,K)+1,K),where r(c_id,n,K)=mod(c_id+n−1,K)+1.

According to another aspect of the present invention, first, N resourcecombinations within each of a plurality of time slots are divided into Ksubsets, with a k-th subset including N_(k) resource combinations, wherek=1, 2, . . . , K. An intra-subset resource mapping scheme isestablished between the resource combinations in the subsets in a firsttime slot and the resource combinations in the subsets in a second timeslot in dependent upon a certain parameter vector n=[n₁, n₂, . . . ,n_(K)], where n_(k) corresponds to a k-th subset. The mapping scheme isestablished by:i _(k,d) =g(i, n )=g _(k)(i _(k,c) ,n _(k)), for k=1, 2, . . . , Kwhere i=i_(k,c), i_(k,c) denotes the index of a resource combinationwithin the N resource combinations in the first time slot, k denotes theindex of the subset where the i_(k,c)-th resource combination islocated, c denotes the index of the i_(k)-th resource combination withinthe k-th subset, i_(k,d) denotes the index of a resource combinationwithin the N resource combinations in the second time slot, k denotesthe index of the subset where the i_(k,d)-th resource combination islocated, d denotes the index of the i_(k,d)-th resource combinationwithin the k-th subset, i_(k,c)=(k−1)×N_(k)+c, i_(k,d)=(k−1)×N_(k)+d,and g(a,b) is a pseudo-random function.

According to yet another aspect of the present invention, first, Nresource combinations within each of a plurality of time slots aredivided into K subsets, with a k-th subset including N_(k) resourcecombinations, where k=1, 2, . . . , K, and N₁=N₂= . . . =N_(K). Aninter-subset interleaving scheme is established in at least one timeslot in accordance with an interleaving parameter PG[s₁, s₂, . . . ,s_(K)]. The inter-subset interleaving scheme is established by:j=w(i,PG[s ₁ ,s ₂ , . . . , s _(K)]), for k=1, 2, . . . , K,where w(i,PG[s₁, s₂, . . . , s_(K)]) denotes the i-th resourcecombination in the time slot after the interleaving in accordance withthe interleaving parameter PG[s₁, s₂, . . . , s_(K)], and theinterleaving parameter PG[s₁, s₂, . . . , s_(K)] indicates that a subsethaving a pre-interleaving index of s_(k) has a post-interleaving indexof k, and 1≦s₁, . . . , s_(K)≦K.

According to still another aspect of the present invention, asymbol-level cyclic shift mapping scheme is established between M cyclicshifts in a first modulation symbol in a transmission channel and Mcyclic shifts in a second modulation symbol in the transmission channelin dependence upon a certain parameter n. The first modulation symbolhas an identification number of 1, and the second modulation symbol hasan identification number of more than 1. The symbol-level cyclic shiftmapping scheme is established by:m′=t(m,l _(—) id, n), for l _(—) id>1,where m denotes the index of a cyclic shift within the first modulationsymbol and m=1, 2, . . . , M, m′ denotes the index of a cyclic shiftwithin the second modulation symbol and m′=1, 2, . . . , M, l_id denotesthe identification number the second modulation symbol, and t(a, b, c)is a pseudo-random function.

According to still yet another aspect of the present invention, aslot-level cyclic shift mapping scheme is established between M cyclicshifts in a first time slot in a transmission channel and M cyclicshifts in a second time slot in the transmission channel in dependenceupon a certain parameter n. The slot-level cyclic shift mapping schemeis established by:m′=g(m,n),where m denotes the index of a cyclic shift within the first time slotand m=1, 2, . . . , M, m′ denotes the index of a cyclic shift within thesecond time slot and m′=1, 2, . . . , M, and g(a,b) is a pseudo-randomfunction.

According to a further aspect of the present invention, a subframe-levelbase sequence mapping scheme is established between Z base sequences ina first subframe in a transmission channel and Z base sequences in asecond subframe in the transmission channel in dependence upon a certainparameter n. The first subframe has an identification number of 1, andthe second subframe has an identification number of more than 1. Thesubframe-level base sequence mapping scheme is established by:z′=s(z, s _(—) id, n), for s _(—) id>1,where z denotes the index of a base sequence within the first subframeand z=1, 2, . . . , Z, z′ denotes the index of a base sequence withinthe second subframe and z′=1, 2, . . . , Z, s_id denotes theidentification number the second subframe, and s(a, b, c) is apseudo-random function.

According to a still further aspect of the present invention, aslot-level base sequence mapping scheme is established between Z basesequences in a first time slot and Z base sequences in a second timeslot 1 in dependence upon a certain parameter n. The first time slot hasan identification number of 1, and the second time slot has anidentification number of more than 1. The slot-level base sequencemapping scheme is established by:z′=s(z, sl _(—) id, n), for sl _(—) id>1,where z denotes the index of a base sequence within the first time slotand z=1, 2, . . . , Z, z′ denotes the index of a base sequence withinthe second time slot and z′=1, 2, . . . , Z, sl_id denotes theidentification number the second time slot, and s(a,b,c) is apseudo-random function.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete appreciation of the invention, and many of the attendantadvantages thereof, will be readily apparent as the same becomes betterunderstood by reference to the following detailed description whenconsidered in conjunction with the accompanying drawings in which likereference symbols indicate the same or similar components, wherein:

FIG. 1 is an illustration of an Orthogonal Frequency DivisionMultiplexing (OFDM) transceiver chain suitable for the practice of theprinciples of the present invention;

FIG. 2 schematically illustrates an example of multiplexing six units ofuser equipments (UEs) within one resource block (RB); and

FIG. 3 schematically illustrates the current working assumption on theuplink acknowledgement and reference signal channels.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 illustrates an Orthogonal Frequency Division Multiplexing (OFDM)transceiver chain. In a communication system using OFDM technology, attransmitter chain 110, control signals or data 111 is modulated bymodulator 112 into a series of modulation symbols, that are subsequentlyserial-to-parallel converted by Serial/Parallel (S/P) converter 113.Inverse Fast Fourier Transform (IFFT) unit 114 is used to transfer thesignals from frequency domain to time domain into a plurality of OFDMsymbols. Cyclic prefix (CP) or zero prefix (ZP) is added to each OFDMsymbol by CP insertion unit 116 to avoid or mitigate the impact due tomultipath fading. Consequently, the signal is transmitted by transmitter(Tx) front end processing unit 117, such as an antenna (not shown), oralternatively, by fixed wire or cable. At receiver chain 120, assumingperfect time and frequency synchronization are achieved, the signalreceived by receiver (Rx) front end processing unit 121 is processed byCP removal unit 122. Fast Fourier Transfinni (FFT) unit 124 transfersthe received signal from time domain to frequency domain for furtherprocessing.

The total bandwidth in an OFDM system is divided into narrowbandfrequency units called subcarriers. The number of subcarriers is equalto the FFT/IFFT size N used in the system. In general, the number ofsubcarriers used for data is less than N because some subcarriers at theedge of the frequency spectrum are reserved as guard subcarriers. Ingeneral, no information is transmitted on guard subcarriers.

On the uplink (UL) of the Third Generation Partnership Project (3GPP)long term evolution (LTE) standard, one type of the resource used in theuplink control channel (PUCCH) is known as a Cyclic shift (CS) for eachOFDM symbol. For example, the PUCCH occupies twelve subcarriers in oneresource block (RB) and therefore we have twelve CS resources in one RB.One example of multiplexing six units of user equipment (UEs) in one RBis shown in FIG. 2. Note that only six out twelve CSs are used in thisexample.

FIG. 3 illustrates the current working assumption on the transmissionblock of UL acknowledgement (ACK) channel and reference signal (RS).ACK/NAK signals and the UL RS for ACK/NACK demodulation are multiplexedon the code channels constructed by both a cyclic shift (CS) of a basesequence and an orthogonal cover (OC). One example of base sequence isZadoff-Chu sequence.

One important aspect of system design is resource remapping on a symbol,slot or subframe-level. Although some methods have been proposed in thepast such as the remapping table based approach disclosed in Reference[5], the remapping table based approach requires the storage of theremapping table and is therefore not desirable. We attempt to find anefficient yet general method for resource remapping in this invention.

In this invention, we first propose a set of new permutation algorithms,then propose to apply these algorithms and the known Pruned Bit ReversalOrdering (PBRO) algorithm, to several various resourceremapping/regrouping problems, including slot or symbol level OrthogonalCover (OC)/Cyclic Shift (CS) remapping, generation of cell-specific slotand symbol-level CS hopping patterns, and generation of subframe andslot level base sequence hopping patterns.

In addition, we note that the Pruned Bit Reversal Ordering (PBRO, orsome times known as PBRI with “I” stands for interleaving) is a knownmethod and has been used in many applications, for example, CCE toresource element (RE) mapping disclosed in Reference [4]. The PBROmethod generates a permutation y=PBRO(i, M) of a sequence of {1, 2, . .. , M} of size M where y is the output value corresponding to the inputvalue i. The PBRO is defined as follows:

-   -   1. Let i=i−1 such that i belongs to the sequence {0, 1, . . . ,        M−1}. Determine the PBRO parameter, n, where n is the smallest        integer such that M≦2^(n).    -   2. Initialize counters i and j to 0.    -   3. Define x as the bit-reversed value of j using an n-bit binary        representation. For example, if n=4 and j=3, then x=12.    -   4. If x<M, set PBRO(i,M) to x and increase i by 1.    -   5. Increment the counter j.    -   6. If i<M go to step 3. Other wise go to steo 7.    -   7. Let j=j+1, such that j belong to the set {1, 2, . . . M}.

Aspects, features, and advantages of the invention are readily apparentfrom the following detailed description, simply by illustrating a numberof particular embodiments and implementations, including the best modecontemplated for carrying out the invention. The invention is alsocapable of other and different embodiments, and its several details canbe modified in various obvious respects, all without departing from thespirit and scope of the invention. Accordingly, the drawings anddescription are to be regarded as illustrative in nature, and not asrestrictive. The invention is illustrated by way of example, and not byway of limitation, in the figures of the accompanying drawings.

1. Proposed Permutation Algorithm

In a first embodiment according to the principles of the presentinvention, we propose a resource permutation function that is based onGalois field operations. Let N be the total number of resources beingpermuted, the operation of permutation function is given by:j=P _(G)(i,n,N)  (1)where i=1, . . . , N is the index of the input resource index, j=1, . .. , N is the output resource index, and n=1, . . . , N is thepermutation sequence index, since a different n provides a differentpermuted output.

We first consider a case where N is an integer that satisfies N=p^(m)−1,where p is a prime number and m is a positive integer. In this case,Galois field N+1 exists and we denote it by GF(N+1). In addition, we canfind a primitive element of this Galois field and call the primitiveelement a which satisfies α^(N)=α^(p) ^(m) ⁻¹⁼¹, and α is an integer. Inaddition, all N non-zero elements in the GF(N+1) can be expressed as anexponent of α, or in another word, the sequence α⁰, α¹, . . . , α^(N-1)includes all N non-zero elements in GF(N+1). Therefore, any inputresource number i can be expressed as a power of the primitive elementi=α^(k) for some integer k such that 0≦k≦N−1. With this notation, theoutput of the resource permutation function P_(G)(i,n,N) is given by:j=P _(G,1)(i,n,N)=α^(mod(k+n−1,N)), for i=1, . . . , N, and n=1, . . . ,N,  (2)where mod(a,b) is the modular operation applied on the two integers aand b. Another similar permutation function can be found as:j=P _(G,2)(i,n,N)=α^(mod(k-(n−1),N)), for i=1, . . . , N, and n=1, . . ., N  (3)Note that we can resort to finite field calculation to find out thenatural number representation of j in the above equation.

On the other hand, we consider the special case where N is an integerthat satisfies N=p¹−1, where p is a prime number. In this case, Galoisfield N+1, i.e., GF(N+1), also exists and is also a ground Galois field.In this, we propose a simpler approach of finding the output permutedresource:j=P _(G,3)(i,n,N)=mod(i×n,N+1), for i=1, . . . , N, and n=1, . . . ,N.  (4)

Furthermore, if N does not satisfy N=p^(m)−1, for some prime number pand positive integer m, then we propose the following Pruned GF fieldbased approach which we denote by P_(G,4a)(i,n,N):

-   -   Step 1: Find the smallest integer M>N such that M satisfies        M=p^(m)−1 where p is a prime number and m is positive. Form        Galois field GF(M+1), find the primitive element α of GF(M+1).        Set variables u=1, and v=1.    -   Step 2: Find w in such a way: if M=p^(m)−1 where p is prime and        m>1, then w can be generated by either w P_(G,1)(n,n,M) or        w=P_(G,2)(v,n,M); if M=p−1 where p is prime, then w can        generated by one of the three functions above:        w=w=P_(G,2)(v,n,M) and w=P_(G,3)(v,n,M).    -   Step 3: if w>N, let v=v+1, go to Step 2; else go to Step 4    -   Step 4: if u=i, go to Step 5; otherwise let u=u+1, v=v+1 and go        to Step 2.    -   Step 5: We have obtained the output resource index        j=w=P_(G,4a)(i,n,N).

We also propose a similar method for the case where N does not satisfyN=p−1, for some prime number p, then we propose the following PrunedGround GF field based approach which we denote by P_(G,4b)(i,n,N):

-   -   Step 1: Find the smallest M>N such that M satisfies M=p−1 where        p is a prime number. Set variables u=1, and v=1.    -   Step 2: Find w by w=P_(G,3)(v,n,M).    -   Step 3: if w>N, let v=v+1, go to Step 2; else go to Step 4.    -   Step 4: if u=i, go to Step 5; otherwise let u=u+1, v=v+1 and go        to Step 2.    -   Step 5: We have obtained the output resource        index=P_(G,4b)(i,n,N).

Let us now summarize the proposed permutation function. Therefore, for aset of inputs i, n, N, where 1≦i≦N and 1≦n≦N, the permutation output isgiven by the function:

$\begin{matrix}{j = {{P_{G}( {i,n,N} )} = \{ \begin{matrix}\begin{matrix}{{P_{G,1}( {i,n,N} )}\mspace{14mu}{or}{\;\;}{P_{G,2}( {i,n,N} )}\mspace{14mu}{or}} \\{{P_{G,3}( {i,n,N} )},}\end{matrix} & \begin{matrix}{{{if}\mspace{14mu} N} = {p - {1\mspace{14mu}{for}\mspace{11mu}{some}\mspace{14mu}{prime}}}} \\{{number}\mspace{14mu} p}\end{matrix} \\\begin{matrix}{{P_{G,1}( {i,n,N} )}\mspace{14mu}{or}\mspace{11mu}{P_{G,2}( {i,n,N} )}\mspace{14mu}{or}} \\{\mspace{14mu}{{P_{G,{4b}}( {i,n,N} )},}}\end{matrix} & \begin{matrix}{{{if}\mspace{14mu} N} = {p^{m} - {1\mspace{14mu}{for}\mspace{11mu}{some}{\mspace{11mu}\;}{prime}}}} \\{{{number}\mspace{14mu} p},{{{and}\mspace{14mu} m} > 1}}\end{matrix} \\\begin{matrix}{{P_{G,{4a}}( {i,n,N} )},{{or}\mspace{14mu}{P_{G,{4b}}( {i,n,N} )}}} \\\;\end{matrix} & \begin{matrix}{{{if}\mspace{14mu} N\mspace{14mu}{can}\mspace{14mu}{not}\mspace{14mu}{be}\mspace{14mu}{expressed}\mspace{11mu}{as}\mspace{14mu} N} =} \\{{p^{m} - 1},\;{{p\mspace{14mu}{is}\mspace{14mu}{prime}\mspace{14mu}{and}\mspace{14mu} m}>=1}}\end{matrix}\end{matrix} }} & (5)\end{matrix}$

Noteworthy, in the above methods, we have assumed input and outputresources are indexed as i=1, . . . , N, and j=1, . . . , N. If theinput index i′ and output j′ are indexed as i′=0, . . . , N−1 and j′=0,. . . , N−1 instead, then the above equation should be used in thefollowing way:j′=P _(G)(i′+1, n,N)−1; for i′=0, . . . , N−1, j′=0, . . . , N−1, andn=1, . . . , N.  (6)

2. Slot-Level Resource Remapping for Orthogonal Cover/Cyclic ShiftCombinations

We first consider the case where there are a total of N resourcesavailable in each of the two slots in the uplink control channel, andeach resource is defined as a combination of orthogonal cover and cyclicshift (OC/CS combo). An example of the application of this type ofresource combo assignment is the uplink ACK/NACK channel. Note that theuplink service grant request channel may reuse the structure of uplinkACK/NACK channel. Another example of application of this type ofresource combo assignment is the uplink demodulation reference symbols(RS).

One example of Orthogonal cover is Walsh-Hadmard code.

On the other hand, cyclic shift (CS) is typically applied on a basesequence, examples of base sequences include ZC (Zadoff-Zhu) code andcomputer generated CAZAC codes. For any base sequence of length N, thereare N cyclic shifts, or N CS resources.

Let us start off by denote the OC/CS combo as CB hereafter. The Nresource combos are given by:CB_(a) [i]=

OC_(a) [u _(i)],CS_(a) [v _(i)]

, for i=1, . . . , N, and a=1, 2,  (7)where u_(i) and v_(i) indicate the OC and CS indices for the ithresource combo, respectively. In addition, a=1, 2 is the slot indexwithin a subframe for the 3GPP LTE uplink transmission.

2.1 Global Resource Remapping

In a second embodiment according to the principles of the presentinvention, let there be N OC/CS resource combos in both slots of anuplink subframe. We propose to associate the OC/CS resource combos insuch a way that if a UE picks the resource combo CAN in the first slot,then the UE must be assigned CB₂[g(i,n)] in the second slot, whereg(i,n) is a pseudo-random resource remapping/permutation function, and nis a parameter.

In a first sub-embodiment of the second embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction is established as:g(i,n)=P _(G)(i,n,N),  (8)where n is chosen from the set {1, 2, . . . , N}, or n=1, . . . , N. Thefunction P_(G)(i,n,N) is defined in the previous section.

In a second sub-embodiment of the second embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction uses the PBRO function in such a way:g(i,n)=PBRO(mod(i+n−1,N)+1,N)  (9)The function PBRO(a,b) is defined previously, and n is chosen from theset {1, 2, . . . , N}.

In a third sub-embodiment of the second embodiment according to theprinciples of the present invention, the parameter n in the above twosub-embodiments is the same for all cells. The parameter n can becommunicated to the UE by means of higher-layer signaling.

In a fourth sub-embodiment of the second embodiment according to theprinciples of the present invention, the parameter n is a function ofCELL ID (c_id), denoted by n=f(c_id). Therefore, for a different c_id,we will have a different parameter n. One example of such a function isn=mod(c_id−1,N)+1.

Before we show an example for these above embodiments, we provide atable of four OC subsets S₁, S₂, S₃ and S₄ as is disclosed in Reference[3]. The three codes in each subsets are denoted as S_(i)(A), S_(i)(B),and S_(i)(C).

TABLE 1 Equivalent mapping between all sets of three OCs. Four subsets AB C S₁ c2 c3 c1 S₂ c1 c4 c2 S₃ c4 c1 c3 S₄ c3 c2 c4where the set of OC codes are given by Walsh codes according toReference [3]:c1=0.5×[1, 1, 1, 1];c2=0.5×[1, −1, 1, −1];c3=0.5×[1, 1, −1, −1];c4=0.5×[1, −1, −1,1].  (10)

We now proceed with one example application of the embodiments. First,the allocation/definition of resource OC/CS combos are given in theTable 2 with N=18, as presented in Reference [3].

TABLE 2 OC/CS Resource Combinations defined on two slots, N = 18. CyclicResource Combos Resource Combos shift in slot #1 - CB₁[ ] in Slot #2 -CB₂[ ] value OC₁[1] OC₁[2] OC₁[3] OC₂[1] OC₂[2] OC₂[3] 0 CB₁[1] [13]CB₂[1] [13] 1 [7] [7] 2 [2] [14] [2] [14] 3 [8] [8] 4 [3] [15] [3] [15]5 [9] [9] 6 [4] [16] [4] [16] 7 [10] [10] 8 [5] [17] [5] [17] 9 [11][11] 10 [6] [18] [6] [18] 11 [12] [12]Note here OC₁[1], OC₁[2], OC₁[3] are the three OC codes used in slot 1,and OC₂[1], OC₂[2], OC₂[3] are the three OC codes used in slot 2. Ingeneral, the OC codes in each slot can be an arbitrary subset of thefour length-4 Walsh codes {c1, c2, c3, c4} defined in Table 1. Oneexample of the OC codes selection is such that the OC codes in the firstslot is given by OC₁[1]=S_(i)(A), OC₁[2]=S_(i)(C), OC₁[3]=S_(i)(B), andthe OC codes in the second slot is given by OC₂[1]=S_(j)(A),OC₂[2]=S_(i)(C), OC₂[3]=S_(j)(B) for a pair of integers (i, j)(Reference [3]). For example, if i=j=2, then we haveOC₁[1]=OC₂[1]=S₂(A)=c1; OC₁[2]=OC₂[2]=S₂(C)=c2; andOC₁[3]=OC₂[3]=S₂(B)=c4.

We now find the association/remapping between the resource combos inslot 1 and slot 2 in this example of 18 OC/CS combos in Table 2. Notethe same association/remapping is applicable to any other case wherethere are N=18 OC/CS combinations, such as the alternative allocationscheme shown in Table 18 in the Annex. Since N=18 and N+1=19 is a primenumber and GF(19) is a ground Galois field, we can useg(i,n)=P_(G,3)(i,n,18)=mod(i×n,19) as the permutation function g(i,n)that associates the slot 1 resource CB₁[i] and slot 2 resourceCB₂[g(i,n)]. This resource remapping function is shown in Table 3 below.Note that only n=1 to n=4 are shown, other parameter values n=5 to n=18can also be used in generating the function g(i,n).

TABLE 3 Resource permutation/remapping function g(i, n) as a function ofparameter n. N = 18. i 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 g(i,n), n = 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 g(i, n), n = 2 24 6 8 10 12 14 16 18 1 3 5 7 9 11 13 15 17 g(i, n), n = 3 3 6 9 12 15 182 5 8 11 14 17 1 4 7 10 13 16 g(i, n), n = 4 4 8 12 16 1 5 9 13 17 2 610 14 18 3 7 11 15

In another example, we have N=12, or 12 OC/CS resource combos in eachslot, as shown in Table 4 below.

TABLE 4 OC/CS Resource Combinations defined on two slots, presented inReference [3]. N = 12. Resource Combos Resource Combos Cyclic shift inslot #1 - CB₁[ ] in Slot #2 - CB₂[ ] value OC₁[1] OC₁[2] OC₁[3] OC₂[1]OC₂[2] OC₂[3] 0 CB₁[1] CB₂[1] 1 [5] [5] 2  [9]  [9] 3 [2] [2] 4 [6] [6]5 [10] [10] 6 [3] [3] 7 [7] [7] 8 [11] [11] 9 [4] [4] 10 [8] [8] 11 [12][12]

We now find the association between the resource combos in slot 1 andslot 2 in this example of Table 4. Note the same association/remappingis applicable to any other case where there are N=12 OC/CS combinations,Since N=12 and N+1=13 is a prime number and GF(13) is a ground Galoisfield, we can use g(i,n)=P_(G,3)(i,n,12)=mod(i×n,13) as the permutationfunction g(i,n) that associates the slot 1 resource CB₁[i] and slot 2resource CB₂[g(i,n)]. This resource remapping function is shown in Table5 below. Note that only n=1 to n=3 are shown, other parameter values n=5to n=12 can also be used in generate the function g(i,n).

TABLE 5 Resource permutation/remapping function g(i, n) as a function ofparameter n. N = 12 i 1 2 3 4 5 6 7 8 9 10 11 12 g(i, n), n = 1 1 2 3 45 6 7 8 9 10 11 12 g(i, n), n = 2 2 4 6 8 10 12 1 3 5 7 9 11 g(i, n), n= 3 3 6 9 12 2 5 8 11 1 4 7 10

In a third embodiment according to the principles of the presentinvention, we propose to assign the subset S_(i) and S_(j) to slot 1 and2 in a subframe, for all UEs within a give cell. In addition, we proposeto associate the indices of subsets, i and j, with the CELL ID, denotedby c_id. One example of this association is:i=mod(c_id−1,4)+1, and j=mod(i+n−1,4)+1  (11)where n is a positive integer. Once the indices i and j are available,for this cell whose CELL ID is c_id, we let:OC₁[1]=S _(i)(A), OC₁[2]=S _(i)(C), OC₁[3]=S _(i)(B),  (12)for the first slot, and let:OC₂[1]=S _(j)(A), OC₂[2]=S _(j)(C), OC₂[3]=S _(j)(B)  (13)for the second slot.

Note that this embodiment applies to, for example, both N=18 and N=12examples shown in Table 2 and Table 4 above.

2.2 Intra-Subset Resource Remapping

In a fourth embodiment according to the principles of the presentinvention, we propose to divide the N resources into K subsets, with ak-th subset having N_(k) elements (k=1, 2, . . . , K), such that

${\overset{K}{\sum\limits_{k = 1}}N_{k}} = {N.}$Furthermore, the subsets in slot#1 and slot #2 have the same indices.The formation of these subsets is shown in Table 6 below.

TABLE 6 Dividing the N OC/CS resource combos into subsets. ResourcesCombos in Slot #1 Resources Combos in Slot #2 Subset 1 {CB₁[i_(1,1)], .. . , CB₁[i_(1,N) ₁ ]} {CB₂[i_(1,1)], . . . , CB₂[i_(1,N) ₁ ]} Subset 2{CB₁[i_(2,1)], . . . , CB₁[i_(2,N) ₂ ]} {CB₂[i_(2,1)], . . . ,CB₂[i_(2,N) ₂ ]} . . . . . . . . . subset K {CB₁[i_(K,1)], . . . ,CB₁[i_(K,N) _(K) ]} {CB₂[i_(K,1)], . . . , CB₂[i_(K,N) _(K) ]}

Furthermore, we propose to associate the OC/CS resource combos in such away that a resource combo in subset #k, slot #1 have to permute to aresource combo in subset #k, slot #2. If a UE picks the resource comboCB₁[i_(k,c)] in the first slot (1≦c≦N_(k)) that belongs to subset #kwithin slot #1, then the UE must be assigned CB₂[g_(k)(i_(k,c),n_(k))]in the second slot, where g_(k)(i_(k,c),n_(k)) is a pseudo-randomresource remapping/permutation function for subset #k, and n_(k) is aparameter for subset #k. Note that i_(k,c)=(k−1)×N_(k)+c. Furthermore,CB₂[g_(k)(i_(k,c),n_(k))] also must be a part of the subset #k withinslot #2, such that g_(k)(i_(k,c),n_(k))=i_(k,d) holds for some1≦d≦N_(k). We proceed to show how to derive output resource indexi_(k,d) for each input index i_(k,c) (derive variable d from variablec). Note that i_(k,d)=(k−1)×N_(k)+d.

In a first sub-embodiment of the fourth embodiment according to theprinciples of the present invention, the resource remapping/permutationwithin each subset uses the Galois Field based permutation functionproposed earlier in Section 1. In each subset k, we associate/remap thetwo resources CA [i_(k,c)] and CB₂[g_(k)(i_(k,c),n_(k))] according to:g _(k)(i _(k,c) ,n _(k))=i _(k,d), where d=P _(G)(c,n _(k) ,N _(k)) fork=1, . . . , K.  (14)Note that here n_(k) is a parameter for subset k such that1≦n_(k)≦N_(k). We can further collect all these parameters into a vectorform n=[n₁, . . . , n_(K)], the total number of possible parametervectors is the product N₁×N₂× . . . ×N_(K). Furthermore, summarizing theresource remapping in all subsets, then for each parameter vector n, wehave defined the overall remapping function over the whole resource set,which we denote as g(i,n) and provide association/remapping between anyresource CB₁[i] in slot #1, and resource CB₂[g(i,n)]. The functiong(i,n) is defined by first finding the subset k where i belongs, thatis, by finding a subset where there is some c, such that i=i_(k,c),furthermore,g(i,n)=g _(k)(i _(k,c) ,n _(k)), for the k, c such that i=i_(k,c).  (15)

In a second sub-embodiment of the fourth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction uses the PBRO function in such a way:g(i _(k,c) ,n _(k))=i _(k,d), where d=PBRO(mod(c+n _(k)−1)+1,N_(k)).  (16)The function PBRO(a,b) is defined in the introduction, and n_(k) ischosen from the set {1, 2, . . . , N}.

In a third sub-embodiment of the fourth embodiment according to theprinciples of the present invention, the parameter vector n=[n₁, . . . ,n_(K)] used in the above two sub-embodiments is the same for all cells.The parameter vector n=[n₁, . . . , n_(K)] can be communicated to the UEby means of higher-layer signaling.

In a fourth sub-embodiment of the fourth embodiment according to theprinciples of the present invention, the parameter vector n=[n₁, . . . ,n_(K)] is a function of CELL ID, denoted by n=f(c_id). Therefore, for adifferent c_id, we can have a different parameter vector n=[n₁, . . . ,n_(K)]. One example of such a function is:n _(k)=mod(c_id−1,N _(k))+1.  (17)

As an example, we apply this set of embodiments is to the 18 resourcesin Table 2. We first divide them into K=3 groups, with six resources ineach group, i.e. N₁=N₂=N₃=6. The division of the resources is shown inTable 7. Note in this example, all OC/CS combos that belong to the sameOC code are grouped into a subset, for a given slot.

TABLE 7 One example of dividing the resources in Table 2 into 3 groups,each with 6 resources. Resources Combos Resources Combos in Slot #1 inSlot #2 Subset 1 {CB₁[1], . . . , CB₁[6]} {CB₂[1], . . . , CB₂[6]}Subset 2 {CB₁[7], . . . , CB₁[12]} {CB₂[7], . . . , CB₂[12]} subset K{CB₁[13], . . . , CB₁[18]} {CB₂[13], . . . , CB₂[18]}

In addition, the slot-level resource remapping can be tabulated in thebelow. Here we have used the permutation equation d=P_(G)(c,n_(k),N_(k))to derive index i_(k,d) from each input index i_(k,c). In particular, wehave used the option d=P_(G,3)(c,n_(k),N_(k))=mod(c×n_(k),N_(k)+1) sinceN_(k)+1=7 is a prime number and GF(7) is a ground Galois field.

TABLE 8(a) Resource re-mapping for subset 1 Resource index in slot #2Resource index in slot #1 i_(1,d) = g₁(i_(1,c), n₁) i_(1,c) = 1 i_(1,c)= 2 i_(1,c) = 3 i_(1,c) = 4 i_(1,c) = 5 i_(1,c) = 6 n₁ = 1 1 2 3 4 5 6n₁ = 2 2 4 6 1 3 5 n₁ = 3 3 6 2 5 1 4 n₁ = 4 4 1 5 2 6 3 n₁ = 5 5 3 1 64 2 n₁ = 6 6 5 4 3 2 1

TABLE 8(b) Resource remapping for subset 2. Resource index in slot #2Resource index in slot #1 i_(2,d) = g₂(i_(2,c), n₂) i_(2,c) = 7 i_(2,c)= 8 i_(2,c) = 9 i_(2,c) = 10 i_(2,c) = 11 i_(2,c) = 12 n₂ = 1 7 8 9 1011 12 n₂ = 2 8 10 12 7 9 11 n₂ = 3 9 12 8 11 7 10 n₂ = 4 10 7 11 8 12 9n₂ = 5 11 9 7 12 10 8 n₂ = 6 12 11 10 9 8 7

TABLE 8(c) Resource remapping for subset 3, Resource index Resourceindex in slot #1 in slot #2 i_(3,c) = 13 i_(3,c) = 14 i_(3,c) = 15i_(3,c) = 16 i_(3,c) = 17 i_(3,c) = 18 i_(3,d) = g(i_(3,c)), 13 14 15 1617 18 n₃ = 1 i_(3,d) = g(i_(3,c)), 14 16 18 13 15 17 n₃ = 2 i_(3,d) =g(i_(3,c)), 15 18 14 17 13 16 n₃ = 3 i_(3,d) = g(i_(3,c)), 16 13 17 1418 15 n₃ = 4 i_(3,d) = g(i_(3,c)), 17 15 13 18 16 14 n₃ = 5 i_(3,d) =g(i_(3,c)), 18 17 16 15 14 13 n₃ = 6

As we seen in the table above, since N₁=N₂=N₃=6, there are six possibleremapping functions within each subset. Therefore, there are a total of6³ parameter vectors n, and thus 6³ possible resource remapping functiong(i,n) over the overall set of eighteen OC/CS combos. We will only listin the table below three examples including n=[n₁,n₂,n₃]=[2,2,2], or[1,2,3], or [2,3,4].

TABLE 9 Overall resource remapping table, where re-mappings take placewithin each subsets. Resource index in second slot Resource in the firstslot, i g(i, n) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 n = [n₁,n₂, n₃] = 1 2 3 4 5 6 8 10 12 7 9 11 15 18 14 17 13 16 [1, 2, 3] n =[n₁, n₂, n₃] = 2 4 6 1 3 5 8 10 12 7 9 11 14 16 18 13 15 17 [2, 2, 2] n= [n₁, n₂, n₃] = 2 4 6 1 3 5 9 12 8 11 7 10 16 13 17 14 18 15 [2, 3, 4]

2.3 Inter-Subset Switching

In a fifth embodiment according to the principles of the presentinvention, we propose to divide the N resources into K subsets, witheach subset having N₁,N₂, . . . , N_(K) elements and such that

${\sum\limits_{k = 1}^{K}N_{k}} = {N.}$Furthermore, the subsets in slot#1 and slot #2 have the same indices.The formation of these subsets are shown in Table 6, similar to theprevious embodiment. In addition, in this embodiment, we assume thenumber of elements within each subset to be the same, i.e., N₁=N₂= . . .=N_(K).

We now propose a resource remapping scheme where we perform asubset-wise switching between different subsets. We denote thisoperation by PG[s₁, s₂, . . . , s_(K)] where 1≦s₁, . . . , s_(K)≦K areindices that indicate the switching pattern in the following way: subset# s₁ in the first slot is remapped to subset #1 in the second slot, #s₂in the first slot is remapped to subset #2 in the second slot, etc. Theintra-subset index of each resource element does not change in thisswitching operation. If a resource in the first slot is denoted byCB₁[i], then after remapping, the resource is denoted by CB₂[w(i,PG[s₁,s₂, . . . , s_(K)])] (or concisely, CB₂[w(i,PG[•])]) in the second slot.In other words, if a UE picks the resource combination CB₁[i] in thefirst slot, then it must be assigned CB₂[g(w(i,PG[s₁, s₂, . . . ,s_(K)]),n)] in the second slot.

In a first sub-embodiment of the fifth embodiment according to theprinciples of the present invention, the inter-subset switching patternPG[s₁, s₂, . . . , s_(K).] is the same for all cells. The parameterPG[s₁, s₂, . . . , s_(K).] can be communicated to the UE by means ofhigher-layer signaling.

In a second sub-embodiment of the fifth embodiment according to theprinciples of the present invention, the inter-subset switching patternPG[s₁, s₂, . . . , s_(K)] is a function of CELL ID, denoted by PG[s₁,s₂, . . . , s_(K).]=e(c_id). Therefore, for a different c_id, we canhave a different inter-subset switching pattern PG[s₁, s₂, . . . ,s_(K)].

For example, we can divide the eighteen OC/CS resources as shown inTable 2 into three subsets in each slot. In this example, each subsetcorresponds to all the resource combos on one OC code. The three subsetsin slot #1 are given by G1[1]={CB₁[1], . . . , CB₁[6]}, G1 [2]={CB₁[7],. . . , CB₁[12]} and G1[3]={CB₁[13], . . . , CB₁[18]}. The subsets inslot #2 are similarly defined as G2[1], G2[2] and G2[3]. We now denotePG[2,3,1] as a subset-wise resource-mapping that maps the resources insubset G1[2] to subset G2[1], subset G1[3] to G2[2] and subset G1[1] tosubset G2[3], etc. Similarly we can define PG[1,3,2], PG[2,1,3],PG[3,1,2], PG[3,2,1]. Several examples of the function g(i, PG[.]) thatassociates the resource combo CB₁[i] in the first slot andCB₂[w(i,PG[•])] in the second slot are given in Table 10.

TABLE 10 Example of subset-wise resource switching Resource index insecond slot, w(i, Resource index in the first slot, i PG[.]) 1 2 3 4 5 67 8 9 10 11 12 13 14 15 16 17 18 PG[1, 3, 2] 1 2 3 4 5 6 13 14 15 16 1718 7 8 9 10 11 12 PG[2, 1, 3] 7 8 9 10 11 12 1 2 3 4 5 6 13 14 15 16 1718 PG[3, 1, 2] 13 14 15 16 17 18 1 2 3 4 5 6 7 8 9 10 11 12 PG[3, 2, 1]13 14 15 16 17 18 7 8 9 10 11 12 1 2 3 4 5 6 PG[2, 3, 1] 7 8 9 10 11 1213 14 15 16 17 18 1 2 3 4 5 6

2.4 Combination of Intra-Subset Remapping and Inter-Subset Switching

In a sixth embodiment according to the principles of the presentinvention, we propose to combine the intra-subset remapping andinter-subset switching described in previous embodiments. If a resourcein the first slot is denoted by CB₁[i], then after remapping, theresource is denoted by CB₂[g(w(i,PG[s₁, s₂, . . . , s_(K)]),n)] (orconcisely, CB₂[g(w(i,PG[•]),n)]) in the second slot. Note we use thecomposite function g(w(i, PG[•]),n) to indicate the combined operationof inter-subset switching and intra-subset permutation. Here PG[s₁, s₂,. . . , s_(K)] is the inter-subset switching pattern, and n=[n₁, . . . ,n_(K)] is the intra-subset remapping parameter vector. This applies toboth cases where the intra-subset permutation g(•,n) function is GFbased, or PBRO based, as defined in Section 2.3.

In a first sub-embodiment of the sixth embodiment according to theprinciples of the present invention, the inter-subset switching patternPG[s₁, s₂, . . . , s_(K)] and/or parameter vector n=[n₁, . . . , n_(K)]are the same for all cells. The parameter PG[s₁, s₂, . . . , s_(K)] andn=[n₁, . . . , n_(K)] can be communicated to the UE by means ofhigher-layer signaling.

In a second sub-embodiment of the sixth embodiment according to theprinciples of the present invention, the inter-subset switching patternPG[s₁, s₂, . . . , s_(K)] and/or parameter vector n=[n₁, . . . , n_(K)]are functions of CELL ID, denoted by PG[s₁, s₂, . . . , s_(K)]=e(c_id)and n=f (c_id). Therefore, for a different c_id, we can have a differentinter-subset switching pattern PG[s₁, s₂, . . . , s_(K)] and/orparameter vector n=[n₁, . . . , n_(K)].

We show in the Table 11 below how the intra-subset permutation can becombined with the inter-subset switching, using the same 18 resourceexample in Table 2. In this example, we have used GF based intra-subsetpermutation functiong(i,n)=g _(k)(i _(k,c) ,n _(k))=i _(k,d) for the k,c such that i=i_(k,c); and  (18)d=P _(G,3)(c,n _(k) ,N _(k))=mod(c×n _(k) ,N _(k)+1).  (19)Note N₁=N₂=N₃=6 in this example where 18 resource combos are dividedinto 3 subsets.

TABLE 11 Example of resource remapping with both intra-subsetpermutation and inter-subset switching. Resource index in second slot,Resource index in the first slot, i g(w(i, PG[.]), n) 1 2 3 4 5 6 7 8 910 11 12 13 14 15 16 17 18 PG[1, 3, 2], 1 2 3 4 5 6 15 18 14 17 13 16 810 12 7 9 11 n = [1, 2, 3] PG[1, 3, 2], 8 10 12 7 9 11 2 4 6 1 3 5 14 1618 13 15 17 n = [2, 2, 2]

2.5 Combining the OC/CS Resource Remapping Schemes with Cell-Specific CSHopping

In a seventh embodiment according to the principles of the presentinvention, we propose to combine the slot-level OC/CS comboresource-permutation methods described in the above Sections 2.1-2.4with a cell-specific symbol-level CS resource hopping pattern, denotedby h_sym(c_id,s_id,l_id), where the CELL ID is denoted by c_id, thesubframe ID is denoted by s_id, and the OFDM symbol (Long block) IDwithin a subframe is denoted by l_id. The additional cell-specifichopping step is carried out by cyclically shift the CS resource on aparticular OFDM by the amount specified by h_sym(c_id,s_id,l_id).

In an eighth embodiment according to the principles of the presentinvention, we propose to combine the symbol-level CSresource-permutation methods described in the above embodiments inSections 2.1-2.4 with a cell-specific slot-level CS resource hoppingpattern, denoted by h_slot(c_id,sl_id), where the CELL ID is denoted byc_id, the slot ID is denoted by sl_id. The additional cell-specifichopping step is carried out by cyclically shift the CS resource on aparticular OFDM by the amount specified by h_slot(c_id,sl_id).

We further describe in detail how to combine the OC/CS resource combopermutation and cell-specific hopping proposed in the seventh and eighthembodiments. Let the possible values of CS in all OC/CS combos in thediscussion be K, and K is also the maximum hop value. Let CB₁[i]=

OC₁[u_(i)], CS₁[v_(i)]

be the resource combo in the first slot, and let CB₁[i]=

OC₁[u_(i)],CS₁[v_(i)]

be associated/remapped with CB₂[j]=

OC₂[u_(j)],CS₂[v_(i)]

in the second slot, according to any of the permutation methodsdescribed in Sections 2.1-2.4. Then if symbol-level cell-specifichopping in the seventh embodiment is used, the CS index i in the firstslot of a subframe will hop tocyclic_shift(v_(i),h_sym(c_id,s_id,l_id),K) for an OFDM symbol having anindex of l_id; and the CS index j in the second slot of a subframe willhop to cyclic_shift(v_(j),h_sym(c_id,s_id,l_id),K). Similarly, ifslot-level cell-specific hopping is used, the CS index i in the firstslot of a subframe will hop to cyclic_shift(v_(i),h_slot(c_id,sl_id),K)for an OFDM symbol having an index of l_id; and the CS index j in thesecond slot of the subframe will hop tocyclic_shift(v_(j),h_slot(c_id,sl_id),K).

Note that the cyclic shift operation is defined as:cyclic_shift(a,b,N)=mod(a+b−1,N)+1,  (20)if the N resources are indexed as 1, 2, . . . , N (this is the casethroughout this document). On the other hand, if the N resources areindexed as 0, 1, 2, . . . , N−1, then the cyclic shift operation isdefined as:cyclic_shift(a,b,N), mod(a+b,N).  (21)

3. Symbol-Level and Slot-Level Resource Remapping for Cyclic ShiftResources

The CS resource assignment/remapping is applicable to the followingcases:

-   -   1. An uplink control RB that contains only Channel Quality        Indicator (CQI) channels;    -   2. An uplink control RB that contains both CQI and ACK/NACK        channels; and    -   3. An uplink control RB that contains only ACK/NACK channels.        Note that uplink service grant request channel may reuse the        structure of uplink ACK/NACK channel.

3.1. Symbol-Level CS Remapping

In a ninth embodiment according to the principles of the presentinvention, we propose to associate the CS resources in such a way thatif some channel of a UE (for example, CQI, ACK/NACK) is allocated the CSresource CS₁[m] in the first OFDM symbol (l_id=1), then it must beassigned CS_(l) _(—) _(id)[t(m,l_id,n)] in the OFDM symbols wherel_id>1, where t(m,l_id,n) is a pseudo-random resourceremapping/permutation function that is a function of the input resourceindex m, the OFDM symbol index l_id, and parameter n that is an integer.Note that m=1, 2, . . . , M and M is the total number of CS resources ineach OFDM symbol.

We further note that when applied to UL A/N channel (or serving grant),the symbol-level CS remapping can be combined with slot-levelOC-remapping or OC hopping. Slot-level OC remapping is very similar tothe slot-level OC/CS combo resource remapping that was discussedthroughout the draft, except that the resource being remapping from oneslot to the next is only the OC resource, not OC/CS combo resource. OChopping has the same meaning as OC hopping in this context.

We note that by definition, t(m,l_id,n)=m for l_id=1, for the first OFDMsymbol under consideration.

In a first sub-embodiment of the ninth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction is established by:t(m,l_id,n)=P _(G)(m,r(l_id,n,M),M), for l_id>1  (22)where r(l_id,n,M)=mod(l_id+n−1,M)+1. The Galois field basedremapping/permutation function P_(G)(m,r,M) is defined in the previoussection.

In a second sub-embodiment of the ninth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction uses the PBRO function in such a way:t(m,l_id,n)=PBRO(mod(m+l_id+n−1,M)+1,M), for l_id>1  (23)The function PBRO(a,b) is defined in the introduction.

In a third sub-embodiment of the ninth embodiment according to theprinciples of the present invention, the parameter n in the above twosub-embodiments is the same for all cells. The parameter n can becommunicated to the UE by means of higher-layer signaling.

In a fourth sub-embodiment of the ninth embodiment according to theprinciples of the present invention, the parameter n is a function ofCELL ID, denoted by n=f(c_id). Therefore, for a different c_id, we willhave a different parameter n. One example of such a function isn=mod(c_id−1,N)+1.

For example, if there are six CS resources in each uplink OFDM symbol,or M=6, and there are L=8 uplink OFDM symbols being considered here.Then one example to let n=0, and let t(m,l_id,n)=P_(G,3)(m,r(l_id,0,6),6). Note here we are able to use theP_(G,3)(•,•,•) function defined earlier, since M+1=7 and GF(7) is aground Galois field. The resource remapping/association as a function ofOFDM symbol index, l_id, is shown in Table 12 below. Here the parametern is chosen as 0.

TABLE 12 Example of CS resource remapping as a function of OFDM symbolid. M = 6, L = 8. Remapped CS resource index t(m, l_id, 0) L_id = 1 l_id= 2 l_id = 3 l_id = 4 l_id = 5 l_id = 6 l_id = 7 l_id = 8 M = 1 1 2 3 45 6 1 2 2 2 4 6 1 3 5 2 4 3 3 6 2 5 1 4 3 6 4 4 1 5 2 6 3 4 1 5 5 3 1 64 2 5 3 6 6 5 4 3 2 1 6 5

3.2 Slot-Level CS Remapping

In a tenth embodiment according to the principles of the presentinvention, we propose to associate the CS resources in such a way thatif some channel of a UE (for example, CQI, ACK/NACK) is allocated the CSresource CS, [m] in the first slot, then the channel must be assignedCS₂[g(m,n)] in the second slot, where g(m,n) is a pseudo-random resourceremapping/permutation function that is a function of the input resourceindex m, and a parameter n that is an integer.

We further note that when applied to UL A/N channel (or serving grant),the slot-level CS remapping can be combined with slot-level OC-remappingor OC hopping.

In a first sub-embodiment of the tenth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction is established by:g(m,n)=P _(G)(m,n,M),  (24)where n is chosen from the set [1, . . . , M], or n=1, . . . , M. Thefunction P_(G)(m,n,M) is defined in the previous section.

In a second sub-embodiment of the tenth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction uses the PBRO function in such a way:g(m,n)=PBRO(mod(m+n−1,M)+1,M).  (25)The function PBRO(a,b) is defined in the introduction.

In a third sub-embodiment of the tenth embodiment according to theprinciples of the present invention, the parameter n in the above twosub-embodiments is the same for all cells. The parameter n can becommunicated to the UE by means of higher-layer signaling.

In a fourth sub-embodiment of the tenth embodiment according to theprinciples of the present invention, the parameter n is a function ofCELL ID, denoted by n=f(c_id). Therefore, for a different c_id, we willhave a different parameter n. One example of such a function isn=mod(c_id−1,M)+1.

We consider here below an example of M=6, for n=1, 2, 3, 4.

TABLE 13 Example of slot-level CS remapping with M = 6. m 1 2 3 4 5 6G(m, n), n = 1 1 2 3 4 5 6 G(m, n), n = 2 2 4 6 1 3 5 G(m, n), n = 3 3 62 5 1 4 G(m, n), n = 4 4 1 5 2 6 3 G(m, n), n = 5 5 3 1 6 4 2 G(m, n), n= 6 6 5 4 3 2 1

The application of the slot-level CS remapping to a dedicated CQI ordedicated A/N uplink RB is straightforward, and therefore we do notprovide additional explanation. On the other hand, the application ofslot-level CS remapping to a mixed CQI and A/N uplink RB is lessobvious, and we provide an example below to show how it works.

Here we show an example of how to apply the slot-level CS remapping inthe case of mixed ACK/NACK and CQI channels within one RB (12subcarriers). Here the total number of CSs used by ACK/NACK and CQI is 8(M=8), and there are a total of 8 ACK/NACK channels sharing 5 CSs, andthree CQI channels sharing 3 CSs. The CS remapping function used in thisexample is g(m,n) with n=2. Note since M+1=9 and GF(9)=GF(3²) is aGalois field but not a ground Galois field. The non-zero elements ofGF(9) is given in the Table 14 below.

TABLE 14 Elements of GF(9) exponent format α⁰ α¹ α² α³ α⁴ α⁵ α⁶ α⁷vector format [1, 0] [0, 1] [1, 1] [1, 2] [2, 0] [0, 2] [2, 2] [2, 1](ternary)[LSB, MSB] natural number 1 3 4 7 2 6 8 5 format

The mapping table of g(m,n) for n=2 is given below for M=8 with GF(9),and g(m,n)=P_(G,1)(m,n,M)=P_(G,1)(m,2,8), where P_(G,1)(m,n,M) isdefined in Section 1.

TABLE 15-a CS remapping with g(m, 2), M = 8. m 1 2 3 4 5 6 7 8 g(m, n),n = 2 3 6 4 7 1 8 2 5

Alternatively, we can use the pruned ground GF field based methodg(m,n)=P_(G,4b)(m,n,M) P_(G,4b)(m,2,8) to generate the following table.

TABLE 15-b Slot-level remapping with g(i, n), N = 8, n = 2. M 1 2 3 4 56 7 8 g(m, n), n = 2 2 4 6 8 1 3 5 7

We proceed to show how the CS resource re-mapping works in table below.Note that there are M=8 CSs, and remapping only takes place within thisset of “used” CSs. We applied the CS remapping rules in Table 15-a aboveto reach this table below. Notice how a single A/N channel or CQIchannel can be remapped to different regions in the OC/CS table.

TABLE 16 CS remapping in mixed CQI and ACK/NACK channel uplink RB. OC/CSCombos OC/CS Combos in slot #1 - in slot #1 - CB₁[ ](ACK/NCK) CB₂[](ACK/NCK) Cyclic shift CS in slot #1 - CS in slot #1 - value -CS_(1,CQI)[ ] (CQI) CS₂[ ] (CQI) [used CS] OC₁[1] OC₁[2] OC₁[3] OC₂[1]OC₂[2] OC₂[3] 0 = [1] A/N #1 A/N #6 A/N#3 A/N #8 1 [2] A/N #4 CQI #2 2[3] A/N #2 A/N #7 A/N #1 A/N #6 3 [4] A/N #5 A/N #2 A/N #7 4 [5] A/N #3A/N #8 CQI #3 5- 6 [6] CQI #1 A/N #4 7- 8-[7] CQI #2 A/N #5 9- 10-[8]CQI #3 CQI #1 11-

3.3 Alternative Method for Resource Remapping in the Mixed CQI andACK/NACK Case

In Table 16, it can be seen that four A/N channels, A/N #1, 2, 6, 7 areassigned to neighboring CSs, after the joint CS remapping on CQI and A/Nchannels. This may degrade A/N performance. In this subsection, wepropose an alternative approach for resource remapping in the mixed CQIand ACK/NACK case.

In an eleventh embodiment according to the principles of the presentinvention, we propose to divide the total CS resources within one RBinto two parts, one part allocated to CQI channel and the other partallocated to the ACK/NACK (or Serving request) channel. The allocationis fixed in two slots of a subframe. In addition, within the part of CSsassigned to the CQI channel, both the symbol-level CS remapping proposedin Section 3.1 and slot-level CS remapping proposed in Section 3.2 canbe applied. On the other hand, within the CS resources allocated to theuplink A/N channels (or serving request), we can apply any of thefollowing (a) the joint slot-level joint OC/CS remapping described inSection 2.1-2.4; (b) the symbol-level CS remapping described in Section3.1; (c) the slot-level CS remapping described in Section 3.2.

We reuse the eight A/N channel and three CQI channel example used inTable 16 to illustrate this alternative approach. Furthermore, in thisexample, we use the slot-level global OC/CS remapping (Section 2.1) forthe A/N part, and use slot-level CS remapping for the CQI part. It isclear from Table 17 that CS resources assigned to the A/N part and theCQI part remain the same in slot #1 and slot #2.

TABLE 17 Illustration of alternative method of resource remapping in theuplink RB with mixed CQI and ACK/NACK channel. OC/CS Combos OC/CS Combosin slot #1 - in slot #1 - CB₁[ ](ACK/NCK) CB₂[ ](ACK/NCK) Cyclic shiftCS in slot #1 - CS in slot #1 - value - CS_(1,CQI)[ ] (CQI) CS₂[ ] (CQI)[used CS] OC₁[1] OC₁[2] OC₁[3] OC₂[1] OC₂[2] OC₂[3] 0 = [1] CB₁[1]CB₁[6] CB₂[1] CB₂[6] 1 [2] CB₁[4] CB₂[4] 2 [3] CB₁[2] CB₁[7] CB₂[2]CB₂[7] 3 [4] CB₁[5] CB₂[5] 4 [5] CB₁[3] CB₁[8] CB₂[3] CB₂[8] 5- 6 [6]CS_(1,CQI)[1] CS_(2,CQI)[1] 7- 8-[7] CS_(1,CQI)[2] CS_(2,CQI)[2] 9-10-[8] CS_(1,CQI)[3] CS_(2,CQI)[3] 11-

In addition, for the A/N (or serving grant) channels, if an A/N channelis assigned the resource combo CB₁[i] in the first slot, then the A/Nchannel must be assigned CB₂[g(i,n)] in the second slot. Let n=2. Oneexample of g(i,n) is to let g(i,n)=P_(G,1)(i,2,8) (note N=8 in thisexample indicating a total of 8 OC/CS combinations for A/N channel, andGF(9) exists). The mapping table is the same as in Table 15-a or 15-b,if we replace m with i, and M with N.

For the CQI channels, on the other hand, if a CQI channel is assignedthe CS resource CS₁[m] in the first slot, then CQI channel must beassigned CS₂[g(m,n)] in the second slot. Similarly, let n=2. One exampleof g(m,n) is to let g(m,n)=P_(G,1)(m,2,3) (note M=3 in this exampleindicating a total of 3 CS resources for A/N channel, and CF(4) exists).The mapping table is omitted here for brevity.

3.4 Combining CS Resource Mapping and Cell-Specific Hopping

In a twelfth embodiment according to the principles of the presentinvention, we propose to combine the symbol-level CSresource-permutation methods described in the above embodiment with acell-specific symbol-level CS resource hopping pattern, denoted byh_sym(c_id,s_id,l_id), where the CELL ID denoted by c_id, the subframeID denoted by s_id, and the OFDM symbol (Long block) ID within asubframe denoted by l_id. The additional cell-specific hopping step iscarried out by cyclically shift the CS resource on a particular OFDM bythe amount specified by h_sym(c_id,s_id,l_id).

In a thirteenth embodiment according to the principles of the presentinvention, we propose to combine the symbol-level CSresource-permutation methods described in the above embodiment with acell-specific slot-level CS resource hopping pattern, denoted byh_slot(c_id,sl_id), where the CELL ID denoted by c_id, the slot IDdenoted by sl_id. The additional cell-specific hopping step is carriedout by cyclically shifting the CS resource on a particular OFDM by theamount specified by h_slot(c_id,sl_id).

We further describe in detail how to combine symbol-level CS resourcepermutation and cell-specific hopping proposed in the above twoembodiments. Let the number of CS resources in the discussion be K, andK is also the maximum hop value. Let CS_(l) _(—) _(id)[t(m,l_id,n)]denote the CS resource for the OFDM symbol l_id, according to thesymbol-level remapping algorithms discussed earlier. Then ifsymbol-level cell-specific hopping is used, the CS index will hop tocyclic_shift(t(m,l_id,n),h_sym(c_id,s_id,l_id),K) for OFDM symbol l_id.Similarly, if slot-level cell-specific hopping is used, the CS index inthe first slot will hop tocyclic_shift(t(m,l_id,n),h_slot(c_id,sl_id),K) for OFDM symbol index byl_id, in the slot indexed by sl_id.

The description of combination of slot-level CS resource remapping andslot or symbol-level cell-specific hopping is similar, and is omittedfor brevity.

4. Generation of the Slot-Level or Symbol-Level Cell-Specific CS HoppingPattern

Let the maximum number of the hop value be denoted by K.

In a fourteenth embodiment according to the principles of the presentinvention, we propose a slot-level base sequence cell-specific patternwith a period of K consecutive slots. We propose a cell-specificslot-level hopping pattern such that:h_slot(c_id,sl_id)=P _(G)(sl_id,r(c_id,n,K),K),  (26)or,h_slot(c_id,sl_id)=PBRO(mod(sl_id+c_id+n−1,K)+1,K),  (27)where the function r is defined as r(c_id,n,K)=mod(c_id+n−1,K)+1. Notesl_id=1, . . . , K is the slot index of the slot within the Kconsecutive slots, n is a parameter that is an integer, and c_id denotesthe CELL ID. The Galois field based remapping/permutation functionP_(G)(c_id,r,K) is defined in Section 1. The PBRO function is previouslydefined.

For example, if there are twelve subcarriers in the LTE uplink controlchannel PUCCH, and thus the maximum hop K=12. Then one example to letn=0, and leth_slot(c_id,sl_id)=P_(G,3)(sl_id,r(c_id,0,12),12)=mod(sl_id×r(c_id,0,12),13).Note here we are able to use the P_(G,3)(•,•,•) function definedearlier, since 12+1=13 and GF(13) is a ground Galois field.

We again let the maximum number of the hop value be denoted by K.Furthermore, we let the L be the number of OFDM symbols of interestwithin a subframe.

In a fifteenth embodiment according to the principles of the presentinvention, we propose a symbol-level base sequence cell-specific patternthat repeats every subframe, i.e., it is not a function of subframe ID.Denoting, s_id as subframe ID, we propose a cell-specific slot-levelhopping pattern such thath_sym(c_id,s_id,l_id)=P _(G)(x(l_id,K),r(c_id,n,K),K),  (28)orh_sym(c_id,s_id,l_id)=PBRO(mod(l_id+c_id+n−1,K)+1,K),  (29)where the function x and r is defined as x(l_id,K)=mod(l_id−1,K)+1 andr(c_id,n,K)=mod(c_id+n−1,K)+1. Note l_id=1, . . . , L denotes the OFDMsymbol (long block) ID, n is a parameter that is an integer, s_iddenotes the subframe ID, and c_id denotes the CELL ID. The Galois fieldbased remapping/permutation function P_(G)(x,r,K) is defined inSection 1. The PBRO function is defined in the introduction.

For example, if there are 12 subcarriers in the LTE uplink controlchannel PUCCH, and thus the maximum hop K=12. Then one example to letn=0, and leth_sym(c_id,s_id,l_id)=P_(G,3)(x(l_id,12),r(c_id,0,12),12)=mod(x(l_id,12)×r(c_id,0,12),13).Note here we are able to use the P_(G,3)(•,•,•) function, definedearlier, since 12+1=13 and GF(13) is a ground Galois field.

5. Generation of the Subframe-Level or Slot-Level Base Sequence HoppingPattern

In a sixteenth embodiment according to the principles of the presentinvention, let there be a total of Z base sequences for uplinkcommunications. Then we propose a subframe-level base sequence hoppingpattern with a period of Z consecutive subframes. In addition, for agiven cell, let BS₁[z]=z be the base sequence index in the firstsubframe within one period of Z consecutive subframes, then the basesequence index used in subsequent subframes in the same cell is denotedby BS_(s) _(—) _(id)[s(z,s_id,n)]. Here z=1, . . . , Z, s_id=1, . . . ,Z, and n is a parameter that is an integer. Note s_id denotes thesubframe ID within a period of Z subframes.

In a sub-embodiment of the sixteenth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction s(z,s_id,n) is given by:s(z,s_id,n)=P _(G)(z,r(s_id,n,Z),Z)  (30)or,s(z,s_id,n)=PBRO(mod(z+s_id+n−1,Z)+1,Z),  (31)where the function r is defined as r(s_id,n,Z)=mod(s_id+n−1,Z)+1. TheGalois field based remapping/permutation function P_(G)(z,r,Z) isdefined in the previous section. The PBRO(.,.) function is defined inthe introduction.

For example, if there are thirty base sequences being used in a cellularsystem, or Z=30. Then one example to let n=0, and let s (z,s_id,n)=P_(G,3)(z,r(s_id,0,30),30)=mod(z x s_id,31). Note here we areable to use the P_(G) function defined earlier, since Z+1=31 and GF(31)is a ground Galois field.

There can be several slots within one subframe in the uplinktransmission. For example, in the 3GPP LTE standard, there are 2 slotswithin each subframe in the uplink.

In a seventeenth embodiment according to the principles of the presentinvention, let there be a total of Z base sequences for uplinkcommunications. Then we propose a slot-level base sequence hoppingpattern with a period of Z consecutive slots. In addition, for a givencell, let BS, [z]=z be the base sequence index in the first slot withinone period of Z consecutive slots, then the base sequence index used insubsequent slots in the same cell is denoted by BS_(s) _(—) _(id) [s(z,sl_id,n)]. Here z=1, . . . , Z, sl_id=1, . . . , Z, and n is a parameterthat is an integer. Note sl_id denotes slot ID within a period of Zslots.

In one sub-embodiment of the seventeenth embodiment according to theprinciples of the present invention, the pseudo-random permutationfunction s(z,sl_id,n) is given bys(z,sl_id,n)=P _(G)(z,r(sl_id,n,Z),Z),  (32)ors(z,sl_id,n)=PBRO(mod(z+sl_id+n−1,Z)+1,Z),  (33)where the function r is defined as r(sl_id,n,Z)=mod(sl_id+n−1,Z)+1. TheGalois field based remapping/permutation function P_(G)(z,r,Z) isdefined in the previous section.

For example, if there are thirty base sequences being used in a cellularsystem, or Z=30. Then one example to let n=0, and let s(z,sl_id,n)=P_(G,3)(z,r(sl_id,0,30),30)=mod(z x sl_id,31). Note here we areable to use the P_(G,3) function defined earlier, since Z+1=31 andGF(31) is a ground Galois field. The PBRO(.,.) function is defined inthe introduction.

Annex: Alternative OC/CS Resource Allocation for N=18 Resources (Excerptfrom [6])

TABLE 18 Alternative OC/CS allocation scheme for N = 18. Cyclic ShiftWalsh Sequence Index Index 0 1 2 3 0 0 15 1 16 4 2 8 3 1 12 4 17 5 5 9 62 13 7 6 8 10 9 3 14 10 7 11 11

While the forgoing explanation of the principles of the presentinvention have been shown and described in detail in connection with thepreferred embodiments, it will be apparent to those skilled in the artthat modifications and variations can be made without departing from thespirit and scope of the invention as defined by the appended claims.

What is claimed is:
 1. A method for data transmission in a communicationsystem, the method comprising: modulating data to be transmitted togenerate a modulated data; selecting a first resource to be used in afirst time based on a function of a first time index; selecting a secondresource to be used in a second time based on the first time index and asecond time index; mapping the modulated data to the selected firstresource and the selected second resource at the first time and thesecond time, respectively; and transmitting the modulated data at eachof the first time and the second time, wherein the first resource andthe second resource are at least one of an orthogonal code and a cyclicshift of a base, wherein each of the first time and second time isdefined on at least one of a symbol level and a slot level, and whereina slot consists of at least one symbol.
 2. The method of claim 1,wherein when the modulated data to be transmitted is acknowledgement andnegative acknowledgement (ACK/NACK) data, the resource is an orthogonalcode and a cyclic shift of a base.
 3. The method of claim 1, whereinwhen the modulated data to be transmitted is Channel Quality Indicator(CQI) data, the resource is a cyclic shift of a base.
 4. The method ofclaim 1, wherein the cyclic shift of a base is defined on a per symbollevel or a slot level based on a symbol index or a slot index,respectively.
 5. The method of claim 1, wherein the orthogonal code isdefined on a per slot level based on a slot index.
 6. The method ofclaim 1, wherein mapping the modulated data comprises symbol wisespreading the modulated data with the orthogonal code.
 7. The method ofclaim 1, wherein selecting the first resource to be used in the firsttime and selecting the second resource to be used in the second time arebased upon an amount of a total resource associated with a correspondingtime index.
 8. The method of claim 1, wherein when a total resource isshared by CQI transmission and ACK/NACK transmission, the total resourceis separated into a portion for CQI transmission and a portion forACK/NACK transmission.
 9. The method of claim 8, wherein resource forCQI transmission and resource for ACK/NACK transmission are selectedamong the portion for CQI transmission and the portion for ACK/NACKtransmission, respectively, at each corresponding time.
 10. An apparatusin a wireless communication network, the apparatus comprising: atransmitter chain configured to: modulate data to be transmitted togenerate a modulated data; select a first resource to be used in a firsttime based on a function of a first time index; select a second resourceto be used in a second time based on the first time index and a secondtime index; map the modulated data to the selected first resource andthe selected second resource at the first time and the second time,respectively; and transmit the modulated data at each of the first timeand the second time, wherein the first resource and the second resourceare at least one of an orthogonal code and a cyclic shift of a base,wherein each of the first time and second time is defined on at leastone of a symbol level and a slot level, and wherein a slot consists ofat least one symbol.
 11. The apparatus of claim 10, wherein when themodulated data to be transmitted is acknowledgement and negativeacknowledgement (ACK/NACK) data, the resource is an orthogonal code anda cyclic shift of a base.
 12. The apparatus of claim 10, wherein whenthe modulated data to be transmitted is Channel Quality Indicator (CQI)data, the resource is a cyclic shift of a base.
 13. The apparatus ofclaim 10, wherein the cyclic shift of a base is defined on a per symbollevel or a slot level based on a symbol index or a slot index,respectively.
 14. The apparatus of claim 10, wherein the orthogonal codeis defined on a per slot level based on a slot index.
 15. The apparatusof claim 10, wherein the transmitter chain is configured to map themodulated data by symbol wise spreading the modulated data with theorthogonal code.
 16. The apparatus of claim 10, wherein the transmitterchain is configured to select the first resource to be used in the firsttime and select the second resource to be used in the second time basedupon an amount of a total resource associated with a corresponding timeindex.
 17. The apparatus of claim 10, wherein when a total resource isshared by CQI transmission and ACK/NACK transmission, the total resourceis separated into a portion for CQI transmission and a portion forACK/NACK transmission.
 18. The apparatus of claim 17, wherein resourcefor CQI transmission and resource for ACK/NACK transmission are selectedamong the portion for CQI transmission and the portion for ACK/NACKtransmission, respectively, at each corresponding time.
 19. An apparatusin a wireless communication network, the apparatus comprising: areceiver chain configured to: receive modulated data mapped to a firstresource at a first time, the first time based on a function of a firsttime index; and receive modulated data mapped to a second resource at afirst time, the second time based on the first time index and a secondtime index, wherein the first resource and the second resource are atleast one of an orthogonal code and a cyclic shift of a base, whereineach of the first time and second time is defined on at least one of asymbol level and a slot level, and wherein a slot consists of at leastone symbol.
 20. The apparatus of claim 19, wherein when the receiveddata is acknowledgement and negative acknowledgement (ACK/NACK) data,the resource is an orthogonal code and a cyclic shift of a base.
 21. Theapparatus of claim 19, wherein when the received data is Channel QualityIndicator (CQI) data, the resource is a cyclic shift of a base.
 22. Theapparatus of claim 19, wherein the cyclic shift of a base is defined ona per symbol level or a slot level based on a symbol index or a slotindex, respectively.
 23. The apparatus of claim 19, wherein theorthogonal code is defined on a per slot level based on a slot index.24. The apparatus of claim 19, wherein the modulated data is mappedusing symbol wise spreading with the orthogonal code.
 25. The apparatusof claim 19, wherein the first resource used in the first time and thesecond resource used in the second time are selected based upon anamount of a total resource associated with a corresponding time index.26. The apparatus of claim 19, wherein when a total resource is sharedby CQI transmission and ACK/NACK transmission, the total resource isseparated into a portion for CQI transmission and a portion for ACK/NACKtransmission.
 27. The apparatus of claim 26, wherein resource for CQItransmission and resource for ACK/NACK transmission are selected amongthe portion for CQI transmission and the portion for ACK/NACKtransmission, respectively, at each corresponding time.
 28. A method fordata transmission in a communication system, the method comprising:receiving modulated data mapped to a first resource at a first time, thefirst time based on a function of a first time index; and receivingmodulated data mapped to a second resource at a first time, the secondtime based on the first time index and a second time index, wherein thefirst resource and the second resource are at least one of an orthogonalcode and a cyclic shift of a base, wherein each of the first time andsecond time is defined on at least one of a symbol level and a slotlevel, and wherein a slot consists of at least one symbol.
 29. Themethod of claim 28, wherein when the received data is acknowledgementand negative acknowledgement (ACK/NACK) data, the resource is anorthogonal code and a cyclic shift of a base.
 30. The method of claim28, wherein when the received data is Channel Quality Indicator (CQI)data, the resource is a cyclic shift of a base.
 31. The method of claim28, wherein the cyclic shift of a base is defined on a per symbol levelor a slot level based on a symbol index or a slot index, respectively.32. The method of claim 28, wherein the orthogonal code is defined on aper slot level based on a slot index.
 33. The method of claim 28,wherein the modulated data is mapped using symbol wise spreading withthe orthogonal code.
 34. The method of claim 28, wherein the firstresource used in the first time and the second resource used in thesecond time are selected based upon an amount of a total resourceassociated with a corresponding time index.
 35. The method of claim 28,wherein when a total resource is shared by CQI transmission and ACK/NACKtransmission, the total resource is separated into a portion for CQItransmission and a portion for ACK/NACK transmission.
 36. The method ofclaim 35, wherein resource for CQI transmission and resource forACK/NACK transmission are selected among the portion for CQItransmission and the portion for ACK/NACK transmission, respectively, ateach corresponding time.